Scalar Product Lattice Computation for Efficient Privacy-Preserving Systems

Privacy-preserving (PP) applications allow users to perform online daily actions without leaking sensitive information. The PP scalar product (PPSP) is one of the critical algorithms in many private applications. state-of-the-art PPSP schemes use either computationally intensive homomorphic (public-key) encryption techniques, such as Paillier achieve strong security (i.e., 128 b) or random masking technique high efficiency for low security. In this article, lattice structures have been exploited develop an efficient system. proposed scheme not only computation compared but also provides a degree against quantum attacks. Rigorous and privacy analyses provided along with concrete set parameters 128-b 256-b Performance analysis shows that at least five orders faster than twice existing randomization Also requires six-time fewer data randomization-based communications.